首页> 外文OA文献 >Joint congestion control and media access control design for ad hoc wireless networks
【2h】

Joint congestion control and media access control design for ad hoc wireless networks

机译:Ad hoc无线网络的联合拥塞控制和媒体访问控制设计

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix, we formulate resource allocation in the network as a utility maximization problem with constraints that arise from contention for channel access. We present two algorithms that are not only distributed spatially, but more interestingly, they decompose vertically into two protocol layers where TCP and MAC jointly solve the system problem. The first is a primal algorithm where the MAC layer at the links generates congestion (contention) prices based on local aggregate source rates, and TCP sources adjust their rates based on the aggregate prices in their paths. The second is a dual subgradient algorithm where the MAC sub-algorithm is implemented through scheduling link-layer flows according to the congestion prices of the links. Global convergence properties of these algorithms are proved. This is a preliminary step towards a systematic approach to jointly design TCP congestion control algorithms and MAC algorithms, not only to improve performance, but more importantly, to make their interaction more transparent.
机译:我们提出了一种用于ad hoc无线网络的拥塞控制和媒体访问控制(MAC)联合设计的模型。使用竞争图和竞争矩阵,我们将网络中的资源分配公式化为效用最大化问题,该问题具有信道访问竞争引起的约束。我们提出了两种算法,它们不仅在空间上分布,而且更有趣的是,它们可垂直分解为两个协议层,其中TCP和MAC共同解决了系统问题。第一种是一种原始算法,其中链路上的MAC层根据本地聚合源速率生成拥塞(竞争)价格,而TCP源则根据路径中的聚合价格来调整其速率。第二个是双重子梯度算法,其中MAC子算法是根据链路的拥塞价格通过调度链路层流来实现的。证明了这些算法的全局收敛性。这是朝着共同设计TCP拥塞控制算法和MAC算法的系统方法迈出的第一步,这不仅提高了性能,而且更重要的是使它们的交互更加透明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号